Automorphisms of Contact Graphs of CAT(0) Cube Complexes
نویسندگان
چکیده
منابع مشابه
Automorphisms of the Cube n
Consider a hypergraph H n where the vertices are points of the d-dimensional combinatorial cube n and the edges are all sets of n points such that they are in one line. We study the structure of the group of automorphisms of H n, i.e., permutations of points of n d preserving the edges. In this paper we provide a complete characterization. Moreover, we consider the Colored Cube Isomorphism prob...
متن کاملThreshold-coloring and unit-cube contact representation of planar graphs
In this paper we study threshold-coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. A pair of vertices with a small difference in their colors implies that the edge between them is present, while a pair of vertices with a big color difference implies that the edge is absent. Not all planar graphs are thre...
متن کاملThreshold-Coloring and Unit-Cube Contact Representation of Graphs
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is present and pairs of vertices with far colors imply the edge is absent. Not all planar graphs are threshold-colorable, but several subclasses, such as trees...
متن کاملAutomorphisms of the Cube n^d
Consider a hypergraph H d n where the vertices are points of the d-dimensional combinatorial cube n d and the edges are all sets of n points such that they are in one line. We study the structure of the group of automorphisms of H d n , i.e., permutations of points of n d preserving the edges. In this paper we provide a complete characterization. Moreover, we consider the Colored Cube Isomorphi...
متن کاملAutomorphisms of trivalent graphs
Let Gg,b be the set of all uni/trivalent graphs representing the combinatorial structures of pant decompositions of the oriented surface ⌃g,b of genus g with b boundary components. We describe the set Ag,b of all automorphisms of graphs in Gg,b showing that, up to suitable moves changing the graph within Gg,b, any such automorphism can be reduced to elementary switches of adjacent edges.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematics Research Notices
سال: 2020
ISSN: 1073-7928,1687-0247
DOI: 10.1093/imrn/rnaa280